Process management apparatus, computer systems, distributed processing method, and computer program for avoiding overhead in a process management device

ABSTRACT

When performing distributed processing in processing devices connected to a network and a processing managing device for managing the processing devices, it is possible to eliminate the overhead of the processing management device. When the processing management device (PU) ( 203 ) managing processing devices (SPU) ( 207 ) under its control receives a task request from one of the SPU, the processing managing device ( 203 ) specifies a cluster matched with the size or type of the task in a cluster list listed up in a predetermined memory, allocates the task to the specified cluster, and transmits to at least one of the cluster and the task request source SPU, communication setting information (such as a communication address) of the other, thereby enabling direct execution result transmission/reception by the network communication between the cluster and the request source SPU.

TECHNICAL FIELD

The present invention relates to a computer system that allows executionof a task efficiently by a plurality of computers connected to abroadband network environment, a distributed process method and computerarchitecture for allowing such a distributed process.

BACKGROUND OF THE INVENTION

It is known to use a plurality of computers connected to the network tocooperate for carrying out distributed processing of a task.Conventionally, when carrying out a distributed processing of a task, aserver in which the processing capabilities of all the computersconnectable with a network are stored is essential in deciding whichtask is assigned to which computer. The server specifies the magnitudeof the load of the task and the excess process capability (calculationresources) of each computer connected to the network when attempting toperform distributed processing. Each task is then sequentially assignedto the computer having the excess processing capability corresponding tothe load, and the executed result of the task is received from thecomputer to which the task is assigned.

In the distributed processing method requiring a server in the priorart, it is very difficult for the server to detect the excess processingcapability of the computers, which are arbitrary connected to anddisconnected from the network. Further, the server must receive theexecuted result from the computer to which the distributed processing ofthe task is requested, and must transmit the result to the requester ofthe task. Thus, the overhead of the server is increased because allcommunication must pass through the server. Therefore, the problem oftenarises that the time required for the execution of the task isincreased, and the time required for the data communications through thenetwork is also increased.

It is a main object of the present invention to provide a structure ofthe distributed processing that overcomes the conventional problem.

DISCLOSURE OF THE INVENTION

The present invention overcomes the above-mentioned problem with adevice and a computer program for a characteristic process managementapparatus, a computer system and distributed processing management.

The process management apparatus of the present invention is adapted tobe connected to a network to which a plurality of processing devices areconnected, each of the processing devices includes a function for (i.e.,is capable of) executing a requested task and transferring the executedresult to a destination designated by the requester of the task,comprising: first management means for allowing access to apredetermined memory in which a cluster list and communication settinginformation for enabling network communication with each of the clustersare listed, wherein the processing devices are sorted into a singlecluster or a plurality of clusters in the cluster list, and the numberof sorted processing devices corresponds to the size or kind of thepreviously estimated task; assigning means for assigning, upon receivinga task demand from any of the processing device through networkcommunication, the task to a specified cluster that is specified byreferring the cluster list for a suitable cluster for the size or thekind of the task; and second management means for transferring, to atleast one cluster or one processing device selected from the groupconsisting of the original processing device that requested the taskdemand and the cluster to which the task is assigned by the assigningmeans, the communication setting information for the other processingdevice or other cluster, thereby allowing direct transfer of theexecuted result between the cluster and the original processing devicethrough network communication. In this way, there is no need for allcommunication to pass through the server and server overhead isdecreased.

The process management apparatus may comprise the memory; and clustermanagement means for recording the cluster list and the communicationsetting information for each cluster in said memory. Further, the taskmay include a task execution request for requesting execution of asubsequent task to be executed subsequently to the execution of thetask; and information for a destination of the executed result of thesubsequent task.

The second management means may request, to the specified cluster,execution of the task that includes a destination of the executed resultof the received task. Alternatively, second management means may causethe original processing device that requested the task demand to requestdirect task execution toward the specified cluster.

A computer system of the present invention comprises: processing devicesthat each includes a function for (i.e., are capable of) executing arequested task and transferring the executed result to a destinationdesignated by the requester of the task; and process managementapparatus connected to the processing device via an internal bus. It isnoted that the processing device and the process management apparatusare connected to a network via the internal bus, respectively.

It is noted that the process management apparatus comprises: firstmanagement means for allowing access to a predetermined memory in whicha cluster list and communication setting information for enablingnetwork communication with each of the clusters are listed, wherein theprocessing devices are sorted into a single cluster or a plurality ofclusters in the cluster list, and the number of sorted processingdevices corresponds to the size or kind of the previously estimatedtask; assigning means for assigning, upon receiving a task demand fromany of the processing device through network communication, the task toa specified cluster that is specified by referring the cluster list fora suitable cluster for the size or the kind of the task; and secondmanagement means for transferring, to at least one cluster or oneprocessing device selected from the group consisting of the originalprocessing device that requested the task demand and the cluster towhich the task is assigned by the assigning means, the communicationsetting information for the other processing device or other cluster,thereby allowing direct transfer of the executed result between thecluster and the original processing device through networkcommunication.

A device for distributed processing management of the present inventionis adapted to be installed in a computer system adapted to be connectedto a network to which a plurality of processing devices are connected,each of the processing devices includes a function for (i.e., is capableof) executing a requested task and transferring the executed result to adestination designated by the requester of the task, wherein the devicefor distributed processing management executes a predetermined computerprogram to cause the computer system to operate as: first managementmeans for allowing access to a predetermined memory in which a clusterlist and communication setting information for enabling networkcommunication with each of the clusters are listed, wherein theprocessing devices are sorted into a single cluster or a plurality ofclusters in the cluster list, and the number of sorted processingdevices corresponds to the size or kind of the previously estimatedtask; assigning means for assigning, upon receiving a task demand fromany of the processing device through network communication, the task toa specified cluster that is specified by referring the cluster list fora suitable cluster for the size or the kind of the task; and secondmanagement means for transferring, to at least one cluster or oneprocessing device selected from the group consisting of the originalprocessing device which requested the task demand and the cluster towhich the task is assigned by the assigning means, the communicationsetting information for the other processing device or other cluster,thereby allowing direct transfer of the executed result between thecluster and the original processing devices through networkcommunication.

A method for performing distributed processing of the present inventionperforms the distributed processing in cooperation between a pluralityof processing devices and a process management apparatus, each of theprocessing devices has a function for executing a requested task andtransferring the executed result to a destination designated by therequester of the task, and the process management apparatus communicateswith each of the processing device via a network, comprising the stepsof: previously sorting, among a plurality of processing units which areavailable for communication, the processing devices, the number of whichcorresponds to the size or kind of the tasks expected to be requested,into a single or a plurality of clusters, and storing the clusterthereof in a predetermined memory area; assigning, upon receiving a taskdemand from any of the processing device through network communication,the task to a specified cluster that is specified from the cluster listand is suitable for the size or the kind of the task; and transferring,to at least one cluster or one processing device selected from the groupconsisting of the cluster to which the task is assigned and the originalprocessing device which requested the task demand, the communicationsetting information for the other processing device or other cluster,thereby allowing direct transfer of the executed result between thecluster and the original processing device through networkcommunication; thereby allowing direct transfer of the executed resultof the task without intervening the process management apparatus.

A computer program of the present invention is a computer program forcausing a computer to operate as a process management apparatus adaptedto be connected to a network to which a plurality of processing devicesare connected, each of the processing devices includes a function (i.e.,is designed to be capable of) for executing a requested task andtransferring the executed result to a destination designated by therequester of the task, wherein the computer program causes the computerto function as: first management means for allowing access to apredetermined memory in which a cluster list and communication settinginformation for enabling network communication with each of the clustersare listed, wherein the processing devices are sorted into a singlecluster or a plurality of clusters in the cluster list, and the numberof sorted processing devices corresponds to the size or kind of thepreviously estimated task; and assigning means for assigning, uponreceiving a task demand from any of the processing device throughnetwork communication, the task to a specified cluster that is specifiedby referring the cluster list for a suitable cluster for the size or thekind of the task; and second management means for transferring, to atleast one cluster or one processing device selected from the groupconsisting of the original processing device which requested the taskdemand and the cluster to which the task is assigned by the assigningmeans, the communication setting information for the other processingdevice or other cluster, thereby allowing direct transfer of theexecuted result between the cluster and the original processing devicesthrough network communication.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is an exemplary diagram illustrating the whole computer systemsto which the present invention is applied.

FIG. 2 is an exemplary diagram illustrating the construction of PE whichis common to all the computers.

FIG. 3 is an exemplary diagram illustrating BE having a plurality of PE.

FIG. 4 is an exemplary diagram illustrating the structure SPU.

FIG. 5 is an exemplary diagram illustrating the packet which istransferred through a network.

FIG. 6 illustrates an exemplary DMA command contained in a packet, FIG.6( a) illustrates a DMA command containing a command for loading theprogram etc., in the local memory of SPU and FIG. 6( b) illustrates aDMA command containing a kick command for kicking a program.

FIG. 7 is an exemplary diagram illustrating an information integratedsystem which comprises a number of SPUs.

FIG. 8 is an exemplary diagram illustrating functions and tables etc.,generated in PU.

FIG. 9 is an exemplary diagram illustrating embodiment representing theuse of a cluster table and a resource list.

FIG. 10 is an exemplary diagram illustrating the relation between aresource list, an SPU status table, and a cluster list.

FIG. 11 illustrates a processing procedure executed in the task managerformed in PU.

FIG. 12 illustrates a processing procedure executed in the resourceallocator formed in PU.

FIG. 13 is an exemplary diagram illustrating an overall processingoutline using a task manager.

FIG. 14 is an alternative exemplary diagram illustrating processingoutline using a task manager.

BEST MODE FOR CARRYING OUT THE INVENTION

Firstly, the overall construction of the computer systems in accordancewith the present invention is described.

<Overview of the Network Type Computer Systems>

FIG. 1 illustrates the whole computer system 101 in accordance with thepresent invention. Computer system 101 includes network 104. An exampleof network 104 includes a local area network (LAN), global network likethe Internet, and other computer networks.

Each of the computers can be connected to network 104 in any timing,respectively, and can perform bi-directional communication with othercomputers. An example of the computer includes personal computer 106,server computer 108, game console 110 with a communication function, PDA112, and other wired or wireless computers and computing devices.

Each computer has a processor element (hereinafter referred as “PE”)that has a common structure, respectively. These PEs all have the sameISA (Instruction Set Architecture) and perform predetermined processingin accordance with the same instruction set. The number of the PEsincluded within respective computers depends upon the processing powerrequired by that computer for processing the task.

Since the PEs of the computer have homogeneous configuration,adaptability in computer system 101 can be improved. Each computer canperform the task requested from others using one or more of its PEs, orusing a part of its PE. Therefore, it becomes less important todetermine the computer for respective task. The executed result of therequested task is transferred by merely specifying the computer that hasrequested the task as a destination computer, or merely specifying acomputer for executing subsequent task, as a destination computer.Therefore, it is possible to carry out distributed execution of eachtask easily among a plurality of computers connected to network 104.

Since each computer includes the PE(s) having a common structure andemploying a common ISA, the computational burdens of an added layer ofsoftware to achieve compatibility among the processors is avoided.Further, many of the problems of heterogeneous networks can be avoided.Therefore, broadband processing can be achieved in this system 101.

<The Architecture of the Computer>

The architecture of the computer is clarified hereinafter. First, theconstructional example of a PE provided in each computer is describedwith reference to FIG. 2.

As shown in FIG. 2, PE 201 includes processor unit (PU) 203, directmemory access controller (DMAC) 205, and a plurality of sub-processorunits (the SPUs) that are different from PUs, i.e., SPU207, SPU209,SPU211, SPU213, SPU215, SPU217, SPU219, and SPU221. PE bus 223interconnects the SPU, the DMAC 205, and PU 203 mutually. PE bus 223 maybe provided with a conventional architecture etc., or may be realized asa packet switch network. When implemented in a packet switch network,further hardware is needed, on the other hand, the amount of availablebandwidth is increased.

PE 201 can be constructed using various methods for implementing digitallogic. However PE 201 preferably is constructed as a single integratedcircuit. PE201 is connected to dynamic random access memory (DRAM) 225through high bandwidth memory connection 227. DRAM 225 functions as themain memory for PE201. Although the main memory preferably is DRAM 225,it could be implemented using other type of memories, e.g., as a staticrandom access memory (SRAM), a magnetic random access memory (MRAM), anoptical memory or a holographic memory. DMAC 205 provides, for PU203 andSPU207, direct memory access (DMA) for DRAM 225. DMA may be implemented,for example, by forming a crossbar switch in the preceding stage.

PU 203 controls SPU 207 etc., by issuing a DMA command to DMAC 205. Inthis case, PU treats SPU 207 etc., as an independent processor.Therefore, in order to control processing by SPU 207 etc., PU usescommands analogous to a remote procedure calls. These commands arecalled “Remote Procedure Call (RPC).” PU 203 performs RPC by issuing aseries of DMA commands to DMAC 205. DMAC 205 loads the program(hereinafter referred as “SPU program”) which is required for SPU toperform the requested execution of a task, and loads its associateddata. Then, PU 203 issues an initial kick command to SPU to execute SPUprogram.

It is not strictly necessary for PU 203 to be provided as a network typeprocessor, and PU 203 may contain a standard processor which can includea stand alone type processor as a main element. This processor reads andexecutes the computer program of the present invention recorded in DRAM225 or a read only memory which is not illustrated in the drawings toform a communication module, while it provides various functions formanagement of SPUs 207 209, 211, 213, 215, 217, 219, and 221, which canbe controlled by the processor, and for management of the SPUs which iscontrolled by other PEs or PEs which are controlled by a BE described inbelow.

Some PEs, e.g., PE 201 illustrated in FIG. 2, can be combined to enhancethe processing capability. For example, as shown in FIG. 3, a pluralityof PEs may be combined and packaged into one or more chip packages etc.,to provide a single computer. The computers having the aboveconstruction are called “broadband engine” (BE).

In the example shown in FIG. 3, four PEs (PE 303, PE 305, PE 307, PE309) are contained in BE 301. These PEs communicate with each other viaBE bus 311. These PEs and shared DRAM 315 are connected via broadbandmemory terminal portion 313. Instead of BE bus 311, communicationbetween PEs of BE 301 can be achieved through shared DRAM 315 and thebroadband memory terminal portion 313. In BE 301, all SPUs provided inone PE can independently, and under predetermined restriction condition,access the data in shared DRAM 315.

Input/output interface (I/O) 317 and an external bus 319 serve as acommunication interface between BE 301 and other computer connected tonetwork 104. I/0 317 is constituted of active devices such as aprocessor, and it controls communication between network 104 and each ofPEs 303, 305, 307 and 309 in BE 301. Further, it receives variousinterruptions from network 104, and transmits them to the correspondingPE. Therefore, in the description below, these may be referred to“network interface”. It is not necessary for such a network interface tobe installed in BE 301, and it may be provided on network 104.

Although not illustrated in FIGS. 2 and 3, PE 201 or BE 301 can consistof a pixel engine for performing image processing, cache for image, anda display controller for a display etc. Such additional functions becomeimportant in the resource management described hereinafter.

The SPUs contained in PE or BE preferably are single instruction,multiple data (SIMD) processors. Under the control of PU 203, SPUsperform the task required via PE in a parallel and independent manner,and the result is output to the corresponding SPU designated by therequest side. In the implement illustrated in FIG. 2, though a PE 201has eight SPUs, the number of SPUs may be arbitrary determined accordingto the processing capability needed.

Hereinafter the structure of SPU is explained in detail. The SPU has thestructure illustrated in FIG. 4. SPU 402 comprises SPU Local memory 406,register 410, a plurality of floating point processing units 412, and aplurality of integer operation units 414. SPU Local memory 406 serves asa local storage for storing data processed in SPU and various threadsexecuted in SPU. The number of floating point processing units 412 andthe number of integer operation units 414 can arbitrarily and previouslybe determined according to the necessary processing capability.

Local memory 406 preferably is constituted as SRAM. SPU 402 includes bus404 for transferring the executed result of the various threads, taskrequest, or the executed result of the task. SPU 402 further includesinternal buses 408, 420, and 418. Internal bus 408 connects local memory406 and the register 410. Internal bus 420 connects register 410 andinteger operation unit 414, and internal bus 418 connects register 410and floating point processing unit 412. In a certain preferredembodiment, the width of buses 418 and 420 from register 410 to floatingpoint processing unit 412 or integer operation unit 414 is wider thanthat of buses 418 and 420 from floating point processing unit 412 orinteger operation unit 414 to register 410. With the wider bandwidth ofthe above bus from register 410 to the floating point processing unit orinteger operation unit 414, the larger data flow from register 410 isobtained.

An absolute timer is employed in the computer, though it is notillustrated in FIGS. The absolute timer provides a clock signal to SPUsand other elements of PE which is both independent of, and faster than,the clock signal driving these elements. The absolute timer establishesa time budget for the performance of tasks by SPUs. This time budgetprovides a time for completing these tasks which is longer than thatnecessary for SPUs' processing of the tasks. As a result, for each task,there is, within the time budget, a busy period and a standby period.SPU programs are written for processing on the basis of this time budgetregardless of SPUs' actual processing time.

<Communication Data>

The computers constructed as mentioned above request a task to othercomputers on network 104 when they are connected to network 104 at thearbitrary timing. Otherwise, the computers generate the communicationdata for transmitting the executed result of the tasks that have beenrequested to and performed by the computers. This communication dataincludes various kinds of information such as requested content of atask, a process program for executing a task, data, communicationsetting information at the designated computer to which the executedresult or the subsequent task is provided. In this embodiment, thesevarious kinds of information are packed in to the packets under thepredetermined data construction, and the packets are delivered among thecomputers.

Generally, the packets are usually delivered via DRAM. For example, whenthe computer has only one PE as shown in FIG. 2, the packets are readfrom DRAM 225, when the computer has BE as shown in FIG. 3, the packetsare read from shared DRAM 315, and the read packets are provided tolocal memory 406 of the respective SPU shown in FIG. 4, and directlyprocessed in the SPU.

In this case, a program counter, a stack, and other software elementsrequired for executing a process program may be included in local memory406 of SPU.

It is noted that DRAM is not always essential for transferring packets.That is, when the computer has single PE only, as shown in FIG. 2, thepackets may be directly loaded into local memory 406 of the respectiveSPU, on the other hand, when the computer has a BE as shown in FIG. 3,the packets may be directly loaded into local memory 406 of therespective SPU from I/O 317, thereby the packets are processed by therespective SPU.

FIG. 5 shows an exemplary construction of the packet. Packet 2302comprises routing information section 2304 and body section 2306.Therefore, the information contained in routing information section 2304is dependent upon the protocol of network 104. Routing informationsection 2304 contains header 2308, address ID 2310, source ID 2312, andreply ID 2314. Destination ID 2310 includes the identifier of SPU towhich the task executed result of the task or the packet for executingthe subsequent task is transferred.

When the identifier of the SPU belongs to one PE, it contains a networkaddress of a network consists of a set of a PE and SPUs, when theidentifier of the SPU belongs to one PE of a BE, it contains a networkaddress of a network consists of a set of BE, PE and SPUs. Under theTCP/IP protocol the network address is an Internet protocol (IP)address. Source ID 2312 comprises the identifier of SPU from which thepacket is transferred. A packet is generated from the SPU identified bythis source ID 2314, and the packet is sent towards network 104. ReplyID 2314 contains the identifier of the SPU to which the query associatedwith the packet and task executed result or the subsequent task aretransferred.

Body 2306 of the packet contains information that is not related to thenetwork protocol. The details of body 2306 are shown in the arearepresented by the dotted line in FIG. 5. Header 2318 of body 2306identifies the start of the body. Packet interface 2322 contains variousinformation necessary for the packet's utilization. This informationincludes global unique ID 2324, SPU(s) 2326 designated for executing thetask, exclusive memory size 2328 and packet ID 2330. It is noted thatthe SPU that previously processed the packet sets packet ID 2330 to thepacket. SPU updates packet ID 2330 upon execution of the required task,and send it to network 104. Global unique ID 2324 is the information foruniquely identifying packet 2302 throughout network 104. This globalunique ID 2324 is generated based on the basis of source ID 2312 (uniqueidentifier of respective SPU in source ID 2312 etc.) and the time andthe date of generation or transmission of packets 2302.

With exclusive memory size 2328, the memory size protected from otherprocessing is established in required SPU that is related to DRAMrequired for execution of the task. Exclusive memory size 2328 is notessential for required data structure. When the memory size ispreviously specified, it is not necessary matter. The identifier of theSPU that executed the previous task among a group of tasks requiringsequential execution can be identified based on packet ID 2330 which isset in the previous executed task.

Implementation section 2332 contains the cell's core information. Inthis core information, DMA command list 2334, processing program 2336required for execution of a task, and data 2338 are contained. Programs2336 contain the programs to be run by the SPU(s) e.g., SPU programs2360 and 2362, and data 2338 contains the data to be processed withthese programs.

When a processing program required for task execution exists in the SPUto which the task is transferred, processing program 2336 is not neededanymore.

DMA command list 2334 contains a series of DMA commands required forstarting of a program.

DMA commands 2340, 2350, 2355, and 2358 are contained in these DMAcommands. The example of these DMA commands 2340, 2350, 2355, and 2358are shown in FIG. 6.

That is, as shown in FIG. 6( a), VID command 2342 is contained in DMAcommand 2340. VID command 2342 is a virtual ID of SPU which is relatedto the physical ID of DRAM 225 when the DMA command is issued. Loadcommand 2344 and address 2346 are also contained in DMA command 2340.Load command 2344 is a command for instructing a SPU to read particularinformation from DRAM 225 for recording it in local memory 406. Based onaddress 2346, the virtual address in DRAM 225 which includes thisparticular information is given. This particular information may beprocessing program 2336, data 2338, or other data. Address 2348 of localmemory 406 is contained in DMA command 2340. Due to this address, theaddress of local memory 406 which is estimated to be capable of loadingall the information currently recorded in the packet is identified. Thisapplies to DMA command 2350.

DMA command 2355 illustrated in FIG. 6( b) contains a kick command.“Kick command” is a command issued by PU to the designated SPU toinitiate the execution by SPU program in the packet. VID command 2352,kick command 2354 mentioned above, and program counter 2356 arecontained in DMA command 2355. In this description, “VID command 2352”is a command for identifying SPU to be kicked. Kick command 2354 givesan associated kick command, and program counter 2356 gives the addressfor the program counter for execution of a SPU program. This applies tothe DMA command 2358.

<Exemplary Operation>

An exemplary operation of computer systems 101 shown in FIG. 1 isdescribed below.

As mentioned above, each computer connected to network 104 have PE(s) ofa common structure, and common ISA. Therefore, the difference betweenarchitecture of the computers connected to network 104 is accommodated.Further, as shown in FIG. 7, in network 104, large scale informationprocessing integrated system WO, in which a number of SPUs in each PErespectively operates as “Cell” for the information processing, isformed.

Each SPU 512 in the large scale information processing integrated systemWO is physically managed by PU 501, 502, 503, 504, 50 n, and 50 m towhich SPU 512 it self belongs, and independently operates as anindependent SPU, or SPUs 512 are grouped and each SPU cooperates withother SPUs. However, in view of logical concept, no wall is providedbetween PUs, therefore, SPU(s) managed by one PU and other SPU(s)managed by other PU(s) can also be grouped. When grouped in the formdescribed above, a task can be executed by distributed processing in theSPUs belonging to one group.

As an exemplary form of distributed processing, a common space which canbe commonly accessed between groups can be provided. A user operating acertain computer can access the common space through the resource of oneor more SPU(s) of the computer. In FIG. 7, G01-G04 show the group of aplurality of SPUs which is provided in large scale informationprocessing integrated system WO, respectively.

Various functions are formed in a PU in order to allow an efficientdistributed processing in such large scale information processingintegrated system WO. FIG. 8 is a diagram of the various lists, tablesand functions formed in a PU in collaboration with the program of thepresent invention.

Task manager 601, resource allocator 603, cluster manager 605, scheduler607, share space manager 609 that becomes an example of a share spacemodule, and communication module 611 are formed in a PU. Communicationmodule 611 performs the two way communication with internal SPU(s) viaPE bus 233 (FIG. 2) while controlling the procedure of two waycommunication between other SPU of a PU (PE/BE) via PE bus 233 andnetwork 104. Communication module 611 refers to table 711 to which therouting data and protocol data are recorded, and performs the abovementioned control.

Cluster manager 605 performs processing for performing clustering of allthe SPUs which can communicate via communication module 611 and taskmanager 601. This processing is specifically described hereinafter.Firstly, the present processing capability and the kinds of the tasksthat can be processed by SPU are obtained. For example, the abovecapability and the kinds of the tasks are obtained through themonitoring thread performed in SPU and the monitoring thread performedby task manager 601. Further, the combination of the kind of the taskthat can be performed in each SPU and processing capability of each SPUis clustered per each kind or size of the task which is estimated to beperformed. Then, the above combination is listed in cluster list 705.

The contents of cluster list 705 are shown, for example in the upper rowof FIG. 9. The minimum unit of a cluster corresponds to one SPU 7050. Inthe embodiment illustrated in FIG. 9, two or more kinds of SPU clusters7051 which consist of one specific SPU, respectively, and SPU clusters7053, 7055, 7057, 7059, 7061, and 7063 which consist of combination oftwo or more SPUs are listed. SPU_id for identifying SPU, the identifier(PU-ref) of PU to which the SPU belongs, and the identificationinformation (valid/invalid) representing whether it can be assigned ornot are recorded, respectively. In FIG. 9, “valid” represents that itcan be assigned, and “invalid” represents that it can not be assigned.

The upper portion of FIG. 10, illustrates the example of SPU clusterconsisting of combination of four SPUs. SPU cluster is created based ontable 7031 which is previously defined according to the number (size) ofSPUs and task size (length). In the example of upper portion of FIG. 10,since the number of SPUs is four, the SPU cluster is generated based onthe data “4” described in “SIZE” of table 7031. The recorded contents ofcluster list 705 are updated at any time. The number (size) of SPU(s) intable 7031 is not limited to numerical value, rather, it may beexpressed by, for example, a function representing a ratio against wholenumber of clusters.

An example of the SPU status table 701 is illustrated in the lowerportion of FIG. 10. The status information (status) is recorded in SPUstatus table 7011 for every SPU_id in PU3302 identified based on“PU-ref” in a certain cluster. Status information shows whether the SPUis currently clustered or not, and shows whether the SPU is in operationor not. It is noted that “busy” shows that the SPU is in operation, thus“none” shows that a back pointer is not necessary.

Task manager 601 performs processes according to the procedureillustrated in FIG. 11. When a task request (task demand) is receivedfrom SPU (TS1001: Yes), the task manager requests, to resource allocator603, assignment of SPU cluster which can perform the requested task(TS1002). When the information of SPU, which belongs to the assigned SPUcluster, is notified from resource allocator 603 (TS1003: Yes), eachSPU_id of all the assigned SPUs is notified to scheduler 607 to reservethe notified SPUs (TS1004), thus avoiding competition of the operationof SPU with other processes.

With reference to the data path that connects a call function betweenone or more processing programs described in the task, and withreference to function table 707 generated from the position informationof assigned SPU, the data path is retrieved (TS1005). It is noted thatthe executed result corresponding to the kind of task to be performed bythe SPU is designated to the data path. Thereafter, the requestedcontent of the task and the data path are transmitted towards the SPUthat performs the first task (TS1006). The examples of description ofthe task are described below.

<Graphic processing> <program=“program for video” name=“video” /><program=“program for audio” name=“audio” /> <program=“program forpackaging into packet” name=“packet” /> <sub from=“video.Video_OUT”to=“packet.Video_IN” /> <sub from=“auido.AUdio_OUT”to=“packet.Autdio_IN” /> <data file=“video_data” to=“video.Data_IN” /><data file=“audio_data” to=“audio.DATA_IN” /> <data file=“packet_data”from=“packet.DATA_OUT” /> </Graphic processing>

The requested content of the task and transmission of the data path maybe performed directly by a PU, i.e., task manager 601. Alternatively,these may be performed by recording data path etc., on the local memoryof the SPU which issued the task demand, creating a packet in the SPU,and transmitting the packet to a network via PE bus.

Alternatively, the requested contents of the task and the data path ofthe SPU which performed the task demand may be transmitted to the SPUwhich is specified by SPU_id of the assigned SPU to directly establish acommunication path from the specified SPU to the SPU which issued taskdemand.

Task manager 601 transmits the schedule information, the statusinformation, and the resource information for the SPU which belongs tothe task manager 601 to other BE, PE, or PE through communication module611. Further, the task manager 601 obtains such information for otherBE, PE, or SPU which belongs to PE. The obtained status information isrecorded in SPU status table 701 via resource allocator, or directly bythe task manager. Similarly, the resource information is recorded inresource list 703.

Resource information represents a type of process which can be currentlyprocessed by each SPU, and degree of processing capability of the same.This resource information is recorded in resource list 703 for everySPU_id. As described above, the SPUs have common structure in allcomputers, however, the kind of process available for SPU may vary basedon whether the processing engine added to the PE to which the SPUbelongs is provided or not, and may vary based on kinds of such aprocessing engine. In case any kind of processing is available as longas an SPU program is loaded, the kind of processing is represented as“all”, as shown in FIG. 9. When there is a kind of specific processingother than “all”, it is represented as “image processing only”, “voiceprocessing only”, or “packaging only”. In case the value of processingcapability is known and common in all SPUs, listing of the value ofprocessing capability can be eliminated.

As described above, the schedule information is information forreserving SPU(s). Scheduler 607 records the schedule information in thetime table (not shown) for each SPU, and notifies to task manager 601the recorded information, if needed.

Resource allocator 603 performs the processes according to the procedureshown in FIG. 12. That is, if a request for assignment is issued throughtask manager 601 (AL1001: Yes), resource allocator 603 will analyze thesize and kind of the task (AL1002). Thereafter, the optimal SPU clusterfor execution of the task is retrieved from SPU clusters listed incluster lists 705 (AL1003).

Examples of search criteria for the optimal SPU cluster are describedbelow. (1) When the argument of search is task size only, i.e., when thevalue of processing capability is common to all SPUs, in a very simpleembodiment, a cluster having matching cluster size is selected from thecluster list, and the first cluster among the clusters having the value“valid” for the identification information in the cluster list isdecided to be assigned. Alternatively, the optimal SPU cluster can bedecided based on network distance. In this case, as to any combinationbetween SPUs constituting the cluster, the network distance (the numberof hosts to be routed to arrive the counterpart SPU) is calculated, anda cluster list sorted in ascending order of maximum value of the networkdistance is generated. Then, the first cluster which has the value“valid” for the identification information in the cluster list isassigned. (2) When the argument of search is a task size and kind of thetask, the cluster list is selected based on the task size, then,checking, as to each cluster having the value “valid” for theidentification information and from the first cluster in the clusterlist, whether an SPU which has an ability for the necessary taskprocessing is included in the cluster list. Further, the clusterincluding an SPU group which can perform the task processing to beprocessed first is returned.

After specifying the optimal SPU cluster as mentioned above, resourceallocator 603 checks the status of the SPU which belongs to thespecified SPU cluster with reference to SPU status table 701 (AL1004).When the assignment is not acceptable because of the “busy” status etc.,(AL1005: No), another SPU cluster is specified from cluster list 705(AL1006), and returning to the processing of AL1004. When the assignmentis acceptable, (AL1005: Yes) all SPUs which can be assigned are notifiedto task manager 601 (AL1007).

Based on shared space management data, the shared space in which two ormore SPUs can participate and leave arbitrarily is generated in a partof the area of the large scale information processing integrated systemWO shown in FIG. 7. Shared space management data is an address etc., ofthe region to which a plurality of SPUs can access simultaneously, forexample. When shared space is generated, it is necessary to share theabove mentioned status information, resource information, and scheduleinformation. Then, shared space manager 609 transmits SPU status table701 and resource list 703 to PU which manages SPU participating in theshared space for synchronizing the updating period of the recordedcontents. Alternatively, cluster list 705 may be mutually transmittedbetween PUs.

The PU lists, in the predetermined memory area, the identificationinformation of the SPUs participating in the shared space and thecommunication setting information of each SPU, further, the PU thenallows them to be available for use (“valid”). On the other hand, as tothe SPU which has left the shared space, the status of the listedinformation is changed to “invalid”.

FIG. 13 illustrates the example of the above mentioned overallprocessing. In FIG. 13, the screened portion represents the clusteredSPUs. Resource allocator 5007 in nature is provided in each PU, however,in order to describe the process in the shared space over a plurality ofPUs, for brevity and clarity, resource allocator 5007 is described asone common resource allocator which resides outside of PU.

This embodiment illustrates an exemplary flow in which, from a given SPU4001 constituting the large scale information integrated system to PU(#B) 5003, a task request is issued in the form of packet. It is notedthat, in this embodiment, the task request is for requestingsynthesizing and packaging of video data and audio data, and forreturning the result to SPU 4001.

If this task demand is transferred to PU (#B) 5003 (“1”), PU (#B) 5003requests assignment of the optimal SPU cluster for execution of thattask to the resource allocator 5007 (“2”). Resource allocator 5007determines, with reference to the resource information of resource list703, that SPU4003 is suitable for video data, and SPU4005 is suitablefor audio data, and SPU4007 is suitable for the packet program. Then,the above determination is notified to PU (#B) 5003 (“3”). To thenetwork address of the PU which manages the SPU, PU (#B) 5003 preparesfor transferring the packet, which includes the communication settinginformation of SPU 4007, to each SPU 4003 and 4005. It is noted that SPU4007 is the destination SPU to which the requested content of the firsttask and the executed result of the task is transferred.

Therefore, the program for video is transferred to SPU4003 of PU (#A),the program for audios is transferred to SPU4005 of PU(#C)5005, and thepacket program is transferred to SPU4007 of PU#A. Then, data path is setin each program.

Data path is acquired by search of function table 707 based on the dataflow described in the task, using the processing program assigned toeach SPU as a key. For example, a program for videos is described below.

“video.VIDEO_OUT→packet.VIDEO_IN”

Based on the assignment information for SPU, this result is translatedas follows.

-   “PU#A:SPU#●:VIDEO_OUT→PU#B:SPU#∘:VIDEO_IN”

Then, the identifier of a designated destination is added. In anexemplary form of the identifier of a destination, when the existingprotocol such as TCP and UDP is used, PU and an IP address are related,further, SPU and a communication port number are related. Alternatively,an individual IP address is assigned to each SPU or PU. Alternatively,the existing protocol is used by specifying PE, BE, or a computer of thedestination by an IP address, and recording them in local storage. Othermethod for designating address other than the method using an IPaddress, for example, the address of the network to which data isallowed to be transferred may be designated by a processor identifierfor each SPU. Due to the above procedure, for example, the data portionof the packet including destination of video data is described asfollows.

“192.168:0.1:10001:VIDEO_OUT→192.168.0.2:10002:VIDEO_IN”

Then, a packet, corresponding to the protocol to be used and includingsuch data portion and a header for causing the packet to be transferredto SPU 4003 and 4005, is generated. Further, the generated packet istransferred to network 104 through the network interface illustrated inFIG. 3 (“4”).

In response to interruption from a network interface, PU (#A) 5001 whichmanages SPU 4003 and PU (#C) which manages SPU 4005 respectively receivea packet, and write the content of the packet in the local memory of SPU4003 and 4005, respectively. SPU 4003 and 4005 thereby perform therequested task. The executed results of the task executed by SPU4003 and4005 are packaged into a packet with the program for the packet, and thepacket is transferred to a designated destination, i.e., SPU4007 (“5”).SPU 4007 is a program for package into packet, and it packages videodata and audio data, then, the resultant is transmitted to SPU4001 whichis a destination designated by each SPU4003 and 4005 (“6”). Thus,SPU4001 can acquire the executed result corresponding to the taskdemand.

Alternatively, each PU may specify the SPU which should receive thepacket by analyzing only the header information of the packet, and thePU may obtain the required packet data for each SPU from the networkinterface or DRAM.

In the above embodiment, the program for packaging is packaged into apacket with the executed result of SPU 4003 or SPU 4005, and the packetis transferred to SPU 4007 to execute the program. Further, as to SPU4003 and SPU 4005, the program of the SPU which finished execution ofthe task prior to the other SPU is executed in SPU 4007, and waiting theexecuted result of other SPU (SPU to which the program for audio orvideo is transferred). However, other than the above embodiment, furtheralternative embodiment described below may be provided.

In this alternative embodiment, similar to the video program and theaudio program, the message represented as “4” causes a program forpacket to be executed by SPU 4007, and SPU 4007 waits the executedresult packet from SPU 4003 and SPU 4005. SPU 4003 and SPU 4005 packagethe executed result into a packet, and transfer it to SPU 4007. Thus,two embodiment is available, in one embodiment all the programs arepreviously transferred to SPU4003, 4005 and 4007 for continuouslyflowing data, in another embodiment, the SPU which finished the task inthe progress of the processes, prior to other SPU packages the executedresult and subsequent program into a packet.

FIG. 14 shows an embodiment similar to the embodiment illustrated inFIG. 13 in which a packet from SPU 4003 causes SPU 4005 to be operable.Further, The executed result and SPU program, which are transferred toSPU4007 from SPU 4005, are transferred to SPU4007 (“6”). After packagedby SPU 4007, these are transferred to other SPU 4009, not to SPU 4001which requested the task, which has been clustered into the same groupas SPU4001 (“7”).

As shown in the above embodiment, PU requests resource allocator 5007 tospecify the optimal SPU, and transmits the request content and thedestination of the task to the specified SPU. Thereby the request offuture tasks and the executed result are transferred only by the SPU,i.e., without any PU. Therefore, the overhead of PU for the request forthe task is avoided.

Since clustering is performed for each previously estimated task size,and the optimal SPU cluster is assigned at the time of task request, thetime necessary for assigning SPU is also decreased. Such an effect issignificantly important for the application in which real timeprocessing is required.

In the embodiments illustrated in FIG. 13 and FIG. 14, by installing thefunction of the PU in the outside of the PU, e.g., the network interfacedescribed above, it also become possible to cause the SPU to executeprocesses in response to direct interruption from the network interface,without an intervening PU. Alternatively, the interface network orprocessing unit corresponding to the PU may be provided on network 104,and a certain SPU may actively access the network interface or theprocessing unit described above to obtain, without a intervening PU,communication setting information etc., for direct access to the targetSPU. In this case, all or a part of the following functions aregenerated in the network interface or the processing unit by cooperationof a predetermined program and an architecture products that isgenerally similar to the PU (e.g., processor or the like).

(a) Resource allocator 603 and 5007, cluster manager 605, or similarfunctions. As to SPU status table 701, resource list 703, and clusterlist 705, these may be installed in the net work interface or theprocessing unit, or these may be managed by a server or a PU forallowing access from the net work interface or the processing unit.

(b) A function for requesting resource allocator 603 or the similarfunction creator to perform optimal SPU cluster assignment for executingtask through network communication, or a function for performing optimalSPU cluster assignment by itself.

(c) A function for requesting, upon receiving a task demand from acertain SPU, cluster manager 605 or a similar function creator toperform assignment of the task for a specified cluster, which isspecified by referring a cluster list for a suitable cluster for thesize or the kind of the task, through network communication, or afunction for performing assignment of the task by itself.

(d) A function for managing (performing record/update by itself, oraccessing to a server in which the network address is recorded) anetwork address of SPU or PU managing SPU.

(e) A function for preparing transfer of a packet, which includescommunication configuration information of designated SPU to which therequested content of the first task and the executed result of the taskis transferred, to a target SPU, or a function for actually transferringa packet to SPU.

According to the present invention, when a process management apparatusreceives a task demand, the process management apparatus specifies theprocessing unit that can carry out the task required for the task demandis specified, and allows direct transfer of the executed result of thetask between the specified processing unit and the origin of taskdemand. Therefore, overhead in the process management apparatus can beavoided. Thus, the distributed processing by a plurality of processingunits can be performed effectively.

1. A process management apparatus adapted to be connected to a networkto which a plurality of processing devices are connected, each of theprocessing devices configured to execute a requested task and totransfer the executed result to a destination designated by therequester of the task, comprising: first management means for allowingaccess to a predetermined memory in which a cluster list andcommunication setting information for enabling network communicationwith each of the clusters are listed, wherein the processing devices aresorted into a plurality of clusters in the cluster list, and the numberof sorted processing devices corresponds to the size or kind of apreviously estimated task, wherein, in the cluster list, each clustercomprising at least one processing device which is/are selected based ona combination of the kind of the task that can be performed in eachprocessing device and a processing capability of the each processingdevice, and the selection is performed per each kind or size of the taskwhich is estimated to be performed, and wherein, in the cluster list,identification information for each cluster representing whether theeach cluster can be assigned or not, is recorded; assigning means forassigning, upon receiving a task demand from any of the processingdevice through network communication, the task to a specified clusterthat is specified by referring the cluster list for a suitable clusterfor the size or the kind of the task; and second management means fortransferring, to the cluster to which the task is assigned by theassigning means or an original processing device that requested the taskdemand, the communication setting information for the other processingdevice or other cluster, thereby allowing direct transfer of theexecuted result between the cluster and the original processing devicethrough network communication.
 2. The process management apparatusaccording to claim 1, further comprising: said memory; and clustermanagement means for recording the cluster list and the communicationsetting information for each cluster in said memory.
 3. The processmanagement apparatus according to claim 1, wherein the task includes: atask execution request for requesting execution of a subsequent task tobe executed subsequently to the execution of the task; and informationfor a destination of the executed result of the subsequent task.
 4. Theprocess management apparatus according to claim 3, wherein the secondmanagement means requests, to the specified cluster, execution of thetask that includes a destination of the executed result of the receivedtask.
 5. The process management apparatus according to claim 3, whereinthe second management means causes the original processing device thatrequested the task demand to request direct task execution toward thespecified cluster.
 6. A computer system comprising: a plurality ofprocessing devices each of which is configured to execute a requestedtask and to transfer the executed result to a destination designated bythe requester of the task; and a process management apparatus connectedto the processing device via an internal bus, wherein the processingdevice and the process management apparatus are connected to a networkvia the internal bus, respectively, the process management apparatuscomprising: first management means for allowing access to apredetermined memory in which a cluster list and communication settinginformation for enabling network communication with each of the clustersare listed, wherein the processing devices are sorted into a pluralityof clusters in the cluster list, and the number of sorted processingdevices corresponds to the size or kind of a previously estimated task,wherein, in the cluster list, each cluster comprising at least oneprocessing device which is/are selected based on a combination of thekind of the task that can be performed in each processing device and aprocessing capability of the each processing device, and the selectionis performed per each kind or size of the task which is estimated to beperformed, and wherein, in the cluster list, identification informationfor each cluster representing whether the each cluster can be assignedor not, is recorded; assigning means for assigning, upon receiving atask demand from any of the processing device through networkcommunication, the task to a specified cluster which is specified byreferring the cluster list for a suitable cluster for the size or thekind of the task; and second management means for transferring, to thecluster to which the task is assigned by the assigning means or anoriginal processing device that requested the task demand, thecommunication setting information for the other processing device orother cluster, thereby allowing direct transfer of the executed resultbetween the cluster and the original processing device through networkcommunication.
 7. A device for distributed processing management adaptedto be installed in a computer system adapted to be connected to anetwork to which a plurality of processing devices are connected, eachof the processing devices configured to execute a requested task and totransfer the executed result to a destination designated by therequester of the task, wherein the device for distributed processingmanagement executes a predetermined computer program to cause thecomputer system to operate as: first management means for allowingaccess to a predetermined memory in which a cluster list andcommunication setting information for enabling network communicationwith each of the clusters are listed, wherein the processing devices aresorted into a plurality of clusters in the cluster list, and the numberof sorted processing devices corresponds to the size or kind of apreviously estimated task, wherein, in the cluster list, each clustercomprising at least one processing device which is/are selected based ona combination of the kind of the task that can be performed in eachprocessing device and a processing capability of the each processingdevice and the selection is performed per each kind or size of the taskwhich is estimated to be performed, and wherein, in the cluster list,identification information for each cluster representing whether theeach cluster can be assigned or not, is recorded; assigning means forassigning, upon receiving a task demand from any of the processingdevice through network communication, the task to a specified clusterthat is specified by referring the cluster list for a suitable clusterfor the size or the kind of the task; and second management means fortransferring, to the cluster to which the task is assigned by theassigning means or an original processing device that requested the taskdemand, the communication setting information for the other processingdevice or other cluster, thereby allowing direct transfer of theexecuted result between the cluster and the original processing devicesthrough network communication.
 8. A method for performing distributedprocessing in cooperation between a plurality of processing devices anda process management apparatus, each of the processing devices has afunction for executing a requested task and transferring the executedresult to a destination designated by the requester of the task, and theprocess management apparatus communicates with each of the processingdevice via a network, comprising the steps of: previously sorting, amonga plurality of processing units that are available for communication,the processing devices, the number of which corresponds to the size orkind of the tasks expected to be requested, into a plurality ofclusters, and storing the cluster thereof in a cluster list of apredetermined memory area, wherein, in the cluster list, each clustercomprising at least one processing device which is/are selected based ona combination of the kind of the task that can be performed in eachprocessing device and a processing capability of the each processingdevice, and the selection is performed per each kind or size of the taskwhich is estimated to be performed, and wherein, in the cluster list,identification information for each cluster representing whether theeach cluster can be assigned or not is recorded; assigning, uponreceiving a task demand from any of the processing device throughnetwork communication, the task to a specified cluster that is specifiedfrom the cluster list and is suitable for the size or the kind of thetask; and transferring, to the cluster to which the task is assigned bythe assigning means or an original processing device that requested thetask demand, the communication setting information for the otherprocessing device or other cluster, thereby allowing direct transfer ofthe executed result between the cluster and the original processingdevice through network communication; thereby allowing direct transferof the executed result of the task without intervening the processmanagement apparatus.
 9. The distributed processing method according toclaim 8, wherein the plurality of processing devices all have aprocessor element having a common structure.
 10. The distributedprocessing method according to claim 9, wherein the processor element ofthe plurality of processing devices employs a common instruction setarchitecture (ISA), and can perform predetermined processing accordingto the same instruction set.
 11. A non-transitory computer-readablemedium storing a computer program for causing a computer to operate as aprocess management apparatus adapted to be connected to a network towhich a plurality of processing devices are connected, each of theprocessing devices configured to execute a requested task and totransfer the executed result to a destination designated by therequester of the task, wherein the computer program causes the computerto function as: first management means for allowing access to apredetermined memory in which a cluster list and communication settinginformation for enabling network communication with each of the clustersare listed, wherein the processing devices are sorted into a pluralityof clusters in the cluster list, and the number of sorted processingdevices corresponds to the size or kind of a previously estimated task,wherein, in the cluster list, each cluster comprising at least oneprocessing device which is/are selected based on a combination of thekind of the task that can be performed in each processing device and aprocessing capability of the each processing device, and the selectionis performed per each kind or size of the task which is estimated to beperformed, and wherein, in the cluster list, identification informationfor each cluster representing whether the each cluster can be assignedor not, is recorded; and assigning means for assigning, upon receiving atask demand from any of the processing device through networkcommunication, the task to a specified cluster that is specified byreferring the cluster list for a suitable cluster for the size or thekind of the task; and second management means for transferring, to thecluster to which the task is assigned by the assigning means or anoriginal processing device that requested the task demand, thecommunication setting information for the other processing device orother cluster, thereby allowing direct transfer of the executed resultbetween the cluster and the original processing devices through networkcommunication.
 12. The process management apparatus according to claim1, wherein the assigning means, upon receiving information of aprocessing device belonging to an assigned cluster, reserves theassigned processing device to avoid competition of operation of theassigned processing device with other processes.
 13. The computer systemaccording to claim 6, wherein the assigning means, upon receivinginformation of a processing device belonging to an assigned cluster,reserves the assigned processing device to avoid competition ofoperation of the assigned processing device with other processes. 14.The device according to claim 7, wherein the assigning means, uponreceiving information of a processing device belonging to an assignedcluster, reserves the assigned processing device to avoid competition ofoperation of the assigned processing device with other processes. 15.The distributed processing method according to claim 8, furthercomprising reserving, upon receiving information of a processing devicebelonging to an assigned cluster, the assigned processing device toavoid competition of operation of the assigned processing device withother processes.
 16. The non-transitory computer-readable mediumaccording to claim 11, wherein the assigning means, upon receivinginformation of a processing device belonging to an assigned cluster,reserves the assigned processing device to avoid competition ofoperation of the assigned processing device with other processes.